A General Algorithm for Triangular Meshes Simplification
نویسنده
چکیده
This article introduces the algorithm for simplification of 2D and 3D triangular meshes. The algorithm evaluates and removes vertices. A hash table is used to speed up the process of selecting the appropriate vertex for its removal. Therefore, this part of the algorithm is executed in constant time O(1). In spite of simplification, triangular mesh models still keep majority of their own essential characteristics. With simplification we also ease transfer of such models through the web. Key–Words: Simplification, Triangular Mesh, Average Plane, Hash Table, 3D Model
منابع مشابه
Multiresolution Techniques for the Simplification of Triangular and Tetrahedral Meshes
We study the simplification of triangular and tetrahedral meshes using techniques based on successive edge collapses, as well as the exploitation of the generated multiple levels of detail for the effective processing of the models. Regarding triangular meshes, we present a method for the construction of progressive hulls, by suitable edge collapses; we use the generated hulls for the accelerat...
متن کاملSimplification, LOD and Multiresolution Principles and Applications
These tutorial notes provide an introduction, review, and discussion of the state-of-the-art on simplification methods, Level Of Detail, and multiresolution models for surface meshes, and of their applications. The problem of approximating a surface with a triangular mesh is formally introduced, and major simplification techniques are classified, reviewed, and compared. A general framework is i...
متن کاملManaging Adjacency in Triangular Meshes
The problem of efficiently accessing and maintaining adjacency information for triangulations over general surface domains is addressed. Rapid access to adjacent vertices, edges, and triangles is an important aspect of multiresolution techniques, from subdivision surfaces to mesh simplification. Novel data structures and algorithms for the construction, manipulation, and traversal of triangulat...
متن کاملCoarse-to-fine approximation of range images with bounded error adaptive triangular meshes
bstract. A new technique for approximating range images with daptive triangular meshes ensuring a user-defined approximation rror is presented. This technique is based on an efficient coarseo-fine refinement algorithm that avoids iterative optimization stages. he algorithm first maps the pixels of the given range image to 3D oints defined in a curvature space. Those points are then tetraheraliz...
متن کاملA Curvature-Tensor-Based Perceptual Quality Metric for 3D Triangular Meshes
Perceptual quality assessment of 3D triangular meshes is crucial for a variety of applications. In this paper, we present a new objective metric for assessing the visual difference between a reference triangular mesh and its distorted version produced by lossy operations, such as noise addition, simplification, compression and watermarking. The proposed metric is based on the measurement of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007